Semantic multi%2Dgrain mixture topic model for text analysis.

An optimal method for prediction and adjustment on byproduct gas holder in steel industry.

On fuzzy filters of pseudo BL%2Dalgebras.

Design considerations for variation tolerant multilevel CMOS%2FNano memristor memory.

Self%2Dadaptive Change Detection in Streaming Data with Non%2Dstationary Distribution.

A Novel Design of Solid%2DState Lighting Control System.

A Novel Design of Solid%2DState Lighting Control System.

A Novel Knowledge%2Ddriven Systems Biology Approach for Phenotype Prediction Upon Genetic Intervention.

Disparity Adjustment for Local Stereo Matching.

Measuring visual saliency by Site Entropy Rate.

Reconfigurable multi%2Dfunction logic based on graphene P%2DN junctions.

GDM2010 Workshop Organizers%27 Message.

Application of Data Mining Technique in Customer Segmentation of Shipping Enterprises.

Design and Implementation of an Intelligent System for Electronic Game%27s Educational Evaluation.

Dynamic Optimization Methods of Emergency Resources Deployment Based on Markov Decision Process for Wenchuan Earthquake.

Dynamic Optimization Methods of Emergency Resources Deployment Based on Markov Decision Process for Wenchuan Earthquake.

Research on Land%2DUse Type of Huainan City Based on Flood Risk Perception and Spatial Multi%2DCriteria Analysis.

Efficient SLCA%2DBased Keyword Search on XML Databases An Iterative%2DSkip Approach.

k%2Dsymmetry model for identity anonymization in social networks.

Suggestion of promising result types for XML keyword search.
Although keyword query enables inexperienced users to easily search XML database with no specific knowledge of complex structured query languages or XML data schemas, the ambiguity of keyword query may result in generating a great number of results that may be classified into different types. For users, each result type implies a possible search intention. To improve the performance of keyword query, it is desirable to efficiently work out the most relevant result type from the retrieved data. Several recent research works have focused on this interesting problem by using data schema information or pure IR-style statical information. However, this problem is still open due to some requirements. (1) The data to be retrieved may not contain schema information; (2) Relevant result types should be efficiently computed before keyword query evaluation; (3) The correlation between a result type and a keyword query should be measured by analyzing the distribution of relevant values and structures within the retrieved data. As we know, none of existing work satisfies the above three requirements together. To address the problem, we propose an estimation-based approach to compute the promising result types for a keyword query, which can help a user quickly narrow down to her specific information need. To speed up the computation, we designed new algorithms based on the indexes to be built. Finally, we present a set of experimental results that evaluate the proposed algorithms and show the potential of this work.
Research on the Establishment of Structural E%2DLearning Resources.

A Novel Watermarking Algorithm Based on Phase Congruency Corner Detection and SVD.

Sentiment analysis of online product reviews with Semi%2Dsupervised topic sentiment mixture model.

Quantum Genetic Algorithm for Signal Detection in MIMO%2DOFDM Systems.

Trusted Network Coding in Wireless Ad Hoc Networks.

Estimation and Modelling of NLoS Time%2DVariant Multipath for Localization Channel Model in Mobile Radios.

SLA%2DBased Resource Co%2DAllocation in Multi%2DCluster Grid.

Quasi%2DMMSE%2FZF Based Limited Feedback Schemes for MU%2DMIMO Precoding.

SLA%2DBased Resource Co%2DAllocation in Multi%2DCluster Grid.

Couple satellite sensor web service with WRF model for weather decision service.

OpenGL application live migration with GPU acceleration in personal cloud.

Cluster based architecture synthesis minimizing the resources under time constraint.

Electrical characterization of RF TSV for 3D multi%2Dcore and heterogeneous ICs.

Research on Performance Evaluation of Universities Governmental S%26T Investment Based on DEA Super.

Study on the Tuition Standard in China Higher Education.

Design and Implementation of Superfluous Mud and Brick Rubbish Transport Management System Based on GIS.

Density Based Merging Search of Functional Modules in Protein%2DProtein Interaction %28PPI%29 Networks.

Image tampering detection based on stationary distribution of Markov chain.

Abstracting Audit Data for Lightweight Intrusion Detection.

A New Analysis of Co%2DTraining.
In this paper, we present a new analysis on co-training, a representative paradigm of disagreement-based semi-supervised learning methods. In our analysis the co-training process is viewed as a combinative label propagation over two views; this provides a possibility to bring the graph-based and disagreementbased semi-supervised methods into a unified framework. With the analysis we get some insight that has not been disclosed by previous theoretical studies. In particular, we provide the sufficient and necessary condition for co-training to succeed. We also discuss the relationship to previous theoretical results and give some other interesting implications of our results, such as combination of weight matrices and view split. 1.
Design of emotional Intelligent Tutor System based on HMM.

A single neuron PID controller based on immune tuning and it%27s application.

Multi%2Dclass Graph Boosting with Subgraph Sharing for Object Recognition.

Internal force compensating method for wall%2Dclimbing caterpillar robot.

An adaptive roadmap guided Multi%2DRRTs strategy for single query path planning.

An adaptive roadmap guided Multi%2DRRTs strategy for single query path planning.

An Immune Concentration Based Virus Detection Approach Using Particle Swarm Optimization.

A New Constant Factor Approximation for Computing 3%2DConnected m%2DDominating Sets in Homogeneous Wireless Networks.

Classification and Diagnosis of Syndromes in Chinese Medicine in the Context of Coronary Heart Disease Model Based on Data Mining Methods.

Growth Characteristics and Fermentation Kinetics of Flocculants%2DProducing Bacterium F2.



An Improved Object Removal Inpainting Method.

Prediction of Coal Mine Safety Level Based on LSSVM.

An Improved Non%2Dnegative Matrix Factorization Algorithm for Combining Multiple Clusterings.

MapDupReducer detecting near duplicates over massive datasets.

An algorithmic approach to event summarization.

GAIA graph classification using evolutionary computation.

PrefIndex An Efficient Supergraph Containment Search Technique.


Improved Kernel based Tracking for Fast Moving Object.

Machine%2Dto%2DMachine Communication in LTE%2DA.


Channel Estimation and Optimal Training Design for Amplify and Forward MIMO Relay Channel under Spatial Fading Correlation.

Energy Efficiency of Heterogeneous Cellular Network.

Primary User Activity Based Channel Allocation in Cognitive Radio Networks.

Reducing Signalling Overhead by an Enhanced Differential Codebook in Multimode MIMO%2DOFDM Systems.

Optimal Resource Allocation for Cognitive Radio Networks with Imperfect Spectrum Sensing.

Multiple%2DLinks NLoS Error Evaluations for Geolocation Channel Modelling.

Prediction%2DBased Spectrum Aggregation with Hardware Limitation in Cognitive Radio Networks.


Extracting 5W1H Event Semantic Elements from Chinese Online News.


Mining High%2DDimensional Data.

Triple RRTs An Effective Method for Path Planning in Narrow Passages.

Left%2Dcontinuity of t%2Dnorms on the n%2Ddimensional Euclidean cube.

Multi%2DView Active Learning in the Non%2DRealizable Case

Re%2Dstructuring
Abstract. This paper considers the use of randomly generated directed graphs as neighborhoods for particle swarm optimizers (PSO) using fully informed particles (FIPS), together with dynamic changes to the graph during an algorithm run as a diversity-preserving measure. Different graph sizes, constructed with a uniform out-degree were studied with regard to their effect on the performance of the PSO on optimization problems. Comparisons were made with a static random method, as well as with several canonical PSO and FIPS methods. The results indicate that under appropriate parameter settings, the use of random directed graphs with a probabilistic disruptive re-structuring of the graph produces the best results on the test functions considered. 1
On the asymptotic behavior of graphs determined by their generalized spectra.

Outdoor to indoor channel characteristics on two different floors.

A comparison of outlier detection algorithms for ITS data.

Multi%2Dgrain hierarchical topic extraction algorithm for text mining.

Using evidence based content trust model for spam detection.

An Approach of Exciting Events Detection in Soccer Sports Videos.

A Better Approximation Algorithm for Computing Connected Dominating Sets in Unit Ball Graphs.

Functional neighbors inferring relationships between nonhomologous protein families using family%2Dspecific packing motifs.

Information%2Dtheoretic limits on sparse signal recovery dense versus sparse measurement matrices.
We study the information-theoretic limits of exactly recovering the support of a sparse signal using noisy projections defined by various classes of measurement matrices. Our analysis is high-dimensional in nature, in which the number of
observations n, the ambient signal dimension p, and the signal
sparsity k are all allowed to tend to infinity in a general manner. This paper makes two novel contributions. First, we provide sharper necessary conditions for exact support recovery using general (non-Gaussian) dense measurement matrices. Combined with previously known sufficient conditions, this result yields a sharp characterization of when the optimal decoder can recover a signal with linear sparsity (k = Θ(p)) using a linear scaling of observations (n = Θ(p)) in the presence of noise. Our second contribution is to prove necessary conditions on the number
of observations n required for asymptotically reliable recovery using a class of γ-sparsified measurement matrices, where the measurement sparsity γ(n, p, k) G (0, 1] corresponds to the fraction of non-zero entries per row. Our analysis allows general scaling of the quadruplet (n, p, k, γ), and reveals three different regimes, corresponding to whether measurement sparsity has no effect, a minor effect, or a dramatic effect on the information-theoretic limits of the subset recovery problem.
Geometry%2Dbased optimal power control of fading multiple access channels for maximum sum%2Drate in cognitive radio networks.

A novel mobility model based on semi%2Drandom circular movement in mobile ad hoc networks.

Utility%2Dbased resource allocation in uplink of OFDMA%2Dbased cognitive radio networks.

Parallel Nonnegative Matrix Factorization Algorithm on the Distributed Memory Platform.

Hardness of k%2DVertex%2DConnected Subgraph Augmentation Problem.

Annotation Based Query Answer over Inconsistent Database.

Continuance Parallel Computation Grid Composed of Multi%2DClusters.

Consistent query answers from virtually integrated XML data.

Efficient mining of skyline objects in subspaces over data streams.

Compact modeling of quantum effects in symmetric double%2Dgate MOSFETs.

A PTAS for minimum d%2Dhop connected dominating set in growth%2Dbounded graphs.

Minimum average routing path clustering problem in multi%2Dhop 2%2DD underwater sensor networks.
Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks
Similarity joins as stronger metric operations.
(ACM) Special Interest Group on Spatial Information (SIGSPATIAL). ACM SIGSPATIAL addresses issues related to the acquisition, management, and processing of spatially-related information with a focus on algorithmic, geometric, and visual considerations. The scope includes, but is not limited to, geographic information systems. Current ACM SIGSPATIAL officers are:
Exploiting remote learners in Internet environment with agents.

Robust adaptive beamforming for large%2Dscale arrays.

IPS%2DMAC an informative preamble sampling MAC protocol for wireless sensor networks.

ICDM 2009
Abstract—With the assistance of a domain expert, active learning can often select or construct fewer examples to request their labels to build an accurate classifier. However, previous works of active learning can only generate and ask specific queries. In real-world applications, the domain experts (or oracles) are often more readily to answer “generalized queries ” with don’t-care attributes. The power of such generalized queries is that one generalized query is often equivalent to many specific ones. However, overly general queries are not good as answers from the domain experts (or oracles) can be highly uncertain, and this makes learning difficult. In this paper, we propose a novel active learning algorithm that asks good generalized queries. We then extend our algorithm to construct new, hierarchical features for both nominal and numeric attributes. We demonstrate experimentally that, our new method asks significantly fewer queries compared with the previous works of active learning, even when the initial labeled dataset is very small, and the oracle is inaccurate in class probability estimations. Our method can be readily deployed in real-world data mining tasks where obtaining labeled examples is costly. This is an extension of the paper published in IEEE ICDM 2009 [16]. Keywords—active learning, domain expert, generalized query. 1
ICDM Workshops 2009

Nano%2DNet %2D 4th International ICST Conference

A route towards production%2Dworthy 5 mro%3Bm %26tmes%3B 25 %26mico%3Bm and 1 %26miro%3Bm imes%3B 20 %26micro%3Bm non%2DBosc thrugh%2Dsilicon%2Dvia %28TSV%29 etch

A Novel Hybrid Intelligent Model for Financial Time Series Forecasting and Its Application.

A Study on the Relationship between Native and Customers%27 Information of the Enterprise.

Input%2Dto%2Dstate stability analysis via averaging for parameterized discrete%2Dtime systems.

A note on input%2Dto%2Dstate stability and averaging of fast switching systems.

Multivariable nonlinear dynamic modeling based on DPLS and Hammerstein model and its application.

A Spatial Faithful Cooperative System Based on Mixed Presence Groupware Model.

Graph classification based on pattern co%2Doccurrence.
Subgraph patterns are widely used in graph classification, but their effectiveness is often hampered by large number of patterns or lack of discrimination power among individual patterns. We introduce a novel classification method based on pattern cooccurrence to derive graph classification rules. Our method employs a pattern exploration order such that the complementary discriminative patterns are examined first. Patterns are grouped into co-occurrence rules during the pattern exploration, leading to an integrated process of pattern mining and classifier learning. By taking advantage of co-occurrence information, our method can generate strong features by assembling weak features. Unlike previous methods that invoke the pattern mining process repeatedly, our method only performs pattern mining once. In addition, our method produces a more interpretable classifier and shows better or competitive classification effectiveness in terms of accuracy and execution time.
A Hierarchical Artificial Immune Model for Virus Detection.

Improving mutual awareness and distributed cognition in collaborative design communication via a virtualized reality%2Dintegrated telepresence system.

New Birthday Attacks on Some MACs Based on Block Ciphers.

Motivated learning agent model for distributed collaborative systems.

Improving mutual awareness and distributed cognition in collaborative design communication via a virtualized reality%2Dintegrated telepresence system.

Bridging shape grammar and Tangible Augmented Reality into collaborative design learning.

Engineering Computational Service Grid A Flexible Engineering Computational Environment Based on Grid Computing.

General Approach for Simulating Heterogeneity of Car%2DFollowing Behaviors.

A Dual%2DCenter Event Description Model Used in Event Tracking.

Genetic Projection Pursuit Interpolation Data Mining Model for Urban Environmental Quality Assessment.

Determination Freshwater Fish Freshness with Gas Sensor Array.

The Algorithm on Adaptive Filtering and Generalized Derivative Estimating for Signals with Uncertain Dynamics.

Classfication and Evolution of HLH Family Members in Poultry Genome.

Workshop Organizers%27 Message.

The Dimension of Bivariate Weak Spline Space W12 %28I1 %94%29.

A Turn%2DBased Algorithm for Solving the Logit Type Network Loading Problem.

Composable IO A Novel Resource Sharing Platform in Personal Clouds.

Workshop Organizers%27 Message.

Effective Snippet Clustering with Domain Knowledge.

Design and Implementation of Wireless Sensor Network Gateway Based on Environmental Monitoring.

Cryptanalysis on HMAC%2FNMAC%2DMD5 and MD5%2DMAC.

Empirical Research and Design of M%2DLearning System for College English.

New Distinguishing Attack on MAC Using Secret%2DPrefix Method.

Projection Pursuit Model Based on Complex Algorithm and its Application in Water Quality Evaluation of Yuqing Lake Reservoir.

Map%2Dmatching for low%2Dsampling%2Drate GPS trajectories.

A New THP Precoding Scheme with Effective Channel Optimization.

A Noncooperative Spectrum Sensing Game with Maximum Network Throughput.

Collaborative Anomaly Detection for Structured P2P Networks.

Optimal Route Selection and Resource Allocation in Multi%2DHop Cognitive Radio Networks.

Sequential Greedy Localization in Wireless Sensor Networks With Inaccurate Anchor Positions.

Exploiting various information for knowledge element relation recognition.

Ethnographic User Study and Concept Design for Chinese Migrant Workers%27 Social Networks.

Mobile Social Service Design for Large%2DScale Exhibition.

Action%2DBased Access Control for Web Services.

An application of host identity tags to DKIM for identifying signers.

Emotional Particle Swarm Optimization.

A Fast Motion Planning Approach for Virtual Human Upper Body.

Informative frequent assembled feature for face detection.

Effective image splicing detection based on image chroma.

Structure%2Doriented Gaussian filter for seismic detail preserving smoothing.

Distinguishing Attack on Secret Prefix MAC Instantiated with Reduced SHA%2D1.

A Proteome Characteristic Pattern of Unstable Angina was Found by Two%2DDimensional Difference Gel Electrophoresis and Least Angle Regression.

Non%2Dinvasive Assessment of Fish Freshness with Bio%2Dimpedance and BP%2DANN Method.


Engineering Signals%27 Blind Source Separation in Frequency Domain and Its Application.


Microwave Radiative Transfer at Frequencies of AMSU%2DB Effects of Uncertainties in Ice Permittivity on Brightness Temperatures.

Docking manipulator for a reconfigurable mobile robot system.

Crawling Locomotion of Modular Climbing Caterpillar Robot with Changing Kinematic Chain.

A Classifier Ensemble Based on Performance Level Estimation.

Instance%2DBased Generative Biological Shape Modeling.

Analog Circuit Fault Fusion Diagnosis Method Based on Support Vector Machine.

Multi%2Dclass Blind Steganalysis Based on Image Run%2DLength Analysis.

A Survey of Passive Image Tampering Detection.

The study on the relationship between inflammatory factors and cardiac function based on chronic myocardial ischemia %28syndrome of blood stasis model%29.

Data Fusion and its Application in Object Recognition in Stereo Sequences.

Channel Characteristics of Different Floors for Joint Communications and Positioning.

SAM enabling practical spatial multiple access in wireless LAN.
Spatial multiple access holds the promise to boost the capacity of wireless networks when an access point has multiple antennas. Due to the asynchronous and uncontrolled nature of wireless LANs, conventional MIMO technology does not work efficiently when concurrent transmissions from multiple stations are uncoordinated. In this paper, we present the design and implementation of a crosslayer system, called SAM, that addresses the challenges of enabling spatial multiple access for multiple devices in a random access network like WLAN. SAM uses a chain-decoding technique to reliably recover the channel parameters for each device, and iteratively decode concurrent frames with misaligned symbol timings and frequency offsets. We propose a new MAC protocol, called CCMA, to enable concurrent transmissions by different mobile stations while remaining backward compatible with 802.11. Finally, we implement the PHY and MAC layer of SAM using the Sora high-performance software radio platform. Our evaluation results under real wireless conditions show that SAM can improve network uplink throughput by 70 % with two antennas over 802.11.
Achievable throughput of multiple access spectrum systems based on cognitive relay.
Cognitive relays form a special cooperation relationship among users in cognitive radio networks, and help increase the transmission rates of both primary users and secondary users. However, we observe that in certain scenarios, the use of relays may deteriorate the performance. In this paper, we propose a novel scheme in the MAC layer, called CodeAssist, by using network coding. It renders every relayed packet useful and recoverable as long as a sufficient number of coded packets are received by the intended terminal. CodeAssist is designed to apply network coding in every relay buffer, and moreover, leads to a lower bound of relayed packets for each secondary user. We also show numerical results for further demonstrations of the improved performance with CodeAssist. Categories and Subject Descriptors
An Improved ETR Protocol with Energy Awareness for Wireless Sensor Networks.

Abnormal Video Sections Detection Based on Inter%2Dframes Information.

Design of movable contactless conductivity detector for microchip capillary electrophoresis.

Optimization of corona%2Dtriggered PDMS%2DPDMS bonding method.

Bottom%2Dup fabrication of special parylene films based on selective growth on Au%2Dcoated surface.

Theoretical analysis and fabrication of PDMS%2Dbased surface plasmon resonance sensor chips.

Microfluidic patterning of nanoparticle monolayer Mechanism analysis and noncontinuously patterning approach.

A novel 3D flexible parylene%2Dmetal structure fabrication technique.

Sora High Performance Software Radio Using General Purpose Multi%2Dcore Processors.
This paper presents Sora, a fully programmable software radio platform on commodity PC architectures. Sora combines the performance and fidelity of hardware SDR platforms with the programmability and flexibility of general-purpose processor (GPP) SDR platforms. Sora uses both hardware and software techniques to address the challenges of using PC architectures for highspeed SDR. The Sora hardware components consist of a radio front-end for reception and transmission, and a radio control board for high-throughput, low-latency data transfer between radio and host memories. Sora makes extensive use of features of contemporary processor architectures to accelerate wireless protocol processing and satisfy protocol timing requirements, including using dedicated CPU cores, large low-latency caches to store lookup tables, and SIMD processor extensions for highly efficient physical layer processing on GPPs. Using the Sora platform, we have developed a demonstration radio system called SoftWiFi. SoftWiFi seamlessly interoperates with commercial 802.11a/b/g NICs, and achieves equivalent performance as commercial NICs at each modulation. 1
Carbon Nanotube Nanorelays with Pass%2DTransistor for FPGA Routing Devices.

Design of Dual%2DFrequency Unequal Power Divider with Genetic Algorithm.

Inferring Genome%2DWide Mosaic Structure.
Genetic recombination plays two essential biological roles. It ensures the fidelity of the transmission of genetic information from one generation to the next and it generates new combinations of genetic variants. Therefore, recombination is a critical process in shaping arrangement of polymorphisms within populations. “Recombination breakpoints ” in a given set of genomes from individuals in a population divide the genome into haplotype blocks, resulting in a mosaic structure on the genome. In this paper, we study the Minimum Mosaic Problem: given a set of genome sequences from individuals within a population, compute a mosaic structure containing the minimum number of breakpoints. This mosaic structure provides a good estimation of the minimum number of recombination events (and their location) required to generate the existing haplotypes in the population. We solve this problem by finding the shortest path in a directed graph. Our algorithm’s efficiency permits genome-wide analysis. 1.
TreeQA Quantitative Genome Wide Association Mapping Using Local Perfect Phylogeny Trees.


FastChi An Efficient Algorithm for Analyzing Gene%2DGene Interactions.

Indoor Propagation Effects on ToA Bias for Joint GNSS and Terrestrial Radio Based Localization.

ToA and TDoA error models for NLoS propagation based on outdoor to indoor channel measurement.

Design and implementation of audio conferencing testbed based on Wi%2DFi MANET.


Increase the end%2Dto%2Dend throughput of a cognitive radio chain by considering the primary usage pattern and transmission scheduling.

Optimal subcarrier and power allocation under interference temperature constraints.

Optimal subcarrier and power allocation under interference temperature constraints.

Localization Algorithm Based on SVM%2DData Fusion in Wireless Sensor Networks.

A Particle Swarm Optimization Based on Chaotic Neighborhood Search to Avoid Premature Convergence.

An incremental SMLAOI algorithm for progressive downloading large scale WebVR scenes.

Design and Realization of a Novel Modular Climbing Caterpillar Using Low%2DFrequency Vibrating Passive Suckers.

A generalized %28G%27%2FG%29%2Dexpansion method and its application to the %282   1%29%2Ddimensional Broer%2DKaup equations.

Effect of Inspection Error on Out%2Dof%2DControl Average Run Length of CUSUM Charts.

Exp%2Dfunction method for a nonlinear ordinary differential equation and new exact solutions of the dispersive long wave equations.

An evidence%2Dbased iterative content trust algorithm for the credibility of online news.

Decision tree learning for freeway automatic incident detection.

Construct support vector machine ensemble to detect traffic incident.

Adaptive fuzzy output tracking control for a class of uncertain nonlinear systems.

Abnormal Sections Detection Based on Inter%2DFrames Information in Video Sequence.

Adaptive Method for Early Detecting Zero Quantized DCT Coefficients in H.264%2FAVC Video Encoding.

Robust Routing and Scheduling in Wireless Mesh Networks under Dynamic Traffic Conditions.

A Theory of Phase Singularities for Image Representation and its Applications to Object Tracking and Image Matching.

An uplink resource allocation scheme for OFDMA%2Dbased cognitive radio networks.

A uniqueness theorem on matrices and reconstruction.

Predicting intrusion goal using dynamic Bayesian network with transfer probability estimation.

The WKB Local Discontinuous Galerkin Method for the Simulation of Schr%F6dinger Equation in a Resonant Tunneling Diode.

Bounding non%2DGL2 and R.E.A.

A Method for Surface Reconstruction Based on Support Vector Machine.

Hash%2DBased Virtual Hierarchies for Scalable Location Service in Mobile Ad%2Dhoc Networks.

Text categorization based on combination of modified back propagation neural network and latent semantic analysis.

A framework for intrusion detection systems by social network analysis methods in ad hoc networks.

Balancing the Role of Priors in Multi%2DObserver Segmentation Evaluation.

Improved pattern recognition with complex artificial immune system.

Efficient algorithms for genome%2Dwide association study.
Studying the association between quantitative phenotype (such as height or weight) and single nucleotide polymorphisms (SNPs) is an important problem in biology. To understand underlying mechanisms of complex phenotypes, it is often necessary to consider joint genetic effects across multiple SNPs. ANOVA (analysis of variance) test is routinely used in association study. Important findings from studying gene-gene (SNP-pair) interactions are appearing in the literature. However, the number of SNPs can be up to millions. Evaluating joint effects of SNPs is a challenging task even for SNP-pairs. Moreover, with large number of SNPs correlated, permutation procedure is preferred over simple Bonferroni correction for properly controlling family-wise error rate and retaining mapping power, which dramatically increases the computational cost of association study. In this article, we study the problem of finding SNP-pairs that have significant associations with a given quantitative phenotype. We propose an efficient algorithm, FastANOVA, for performing ANOVA tests on SNP-pairs in a batch mode, which also supports large permutation test. We derive an upper bound of SNP-pair ANOVA test, which can be expressed as the sum of two terms. The first term is based on single-SNP ANOVA test. The second term is based on the SNPs and independent of any phenotype permutation. Furthermore, SNP-pairs can be organized into groups, each of which shares a common upper bound. This allows for maximum reuse of intermediate computation, efficient upper bound estimation, and effective SNP-pair pruning. Consequently, FastANOVA only needs to perform the ANOVA test on a small number of candidate SNP-pairs without the risk of missing any significant ones. Extensive experiments demonstrate that FastANOVA is orders of magnitude faster than the brute-force implementation of ANOVA tests on all SNP pairs. The principles used in FastANOVA can be applied to categorical phenotypes and other statistics such as Chi-square test.
Improving the Survivability of WSNs with Biological Characters Based on Rejuvenation Technology.

Visualization Enhancement of Arthrosis Tissues Structure in Ultrasound Image Based on Improved Diffusion.

A Clustering Algorithm Incorporating Density and Direction.

News Analysis Based on Meta%2Dsynthesis Approach.

A Fourth%2DOrder Compact BVM Scheme for the Two%2DDimensional Heat Equations.

Multiple Nests%27 Cooperation ACO Based Union%2DIntersection Operations.

Application of 3D Virtual Presentation Technology in Product Customer System.

Learning to Rank with Bayesian Evidence Framework.

Image Denoising Based on Contourlet%2DDomain HMT Models Using Cycle Spinning.

The Output Regulation for Tracking Unusual Motion Patterns by Active Disturbance Rejection Control.

The Design of Web%2DBased Intelligent Item Bank.

Evaluating Heterogeneous Memory Model by Realistic Trace%2DDriven Hardware%2FSoftware Co%2Dsimulation.

CARE Finding Local Linear Correlations in High Dimensional Data.

Using SPIN to Detect Vulnerabilities in the AACS Drive%2DHost Authentication Protocol.

A Probabilistic Method to Estimate Life Expectancy of Application Software.

Fuzzy C%2DMeans Text Clustering with Supervised Feature Selection.

Improving Fuzzy C%2DMeans Clustering Based on Adaptive Weighting.

A Hybrid Statistical Language Model Applied to the Domain Specific Information Retrieval.

Community Detection in Social Networks Employing Component Independency.

Asynchronous Distributed Power Control under Interference Temperature Constraints.

Phase singularities for image representation and matching.

CRMS A Collusion%2DResistant Matrix System for Group Key Management in Wireless Networks.

CARE Finding Local Linear Correlations in High Dimensional Data.

Applications of the Fuzzy Immune PID Control and the Genetic Algorithm in the Automated Pharmacy System.

On multi%2Dview active learning and the combination with semi%2Dsupervised learning.
Multi-view learning has become a hot topic during the past few years. In this paper, we first characterize the sample complexity of multi-view active learning. Under the α-expansion assumption, we get an exponential improvement in the sample complexity 1 1 from usual Õ(
An XML Firewall on Embedded Network Processor.

Bridge the gap between syndrome in Traditional Chinese Medicine and proteome in western medicine by unsupervised pattern discovery algorithm.

A clustering algorithm combine the FCM algorithm with supervised learning normal mixture model.

Symmetric segment%2Dbased stereo matching of motion blurred images with illumination variations.

Enhanced Architecture of TPM.

A Scheme of Test Pattern Generation Based on Reseeding of Segment%2DFixing Counter.

Implementation of Pointer Logic for Automated Verification.

A New Optimal Policy for Service System with Nonstationary Stochastic Demand.

Deformation%2Dbased nonlinear dimension reduction Applications to nuclear morphometry.

Analyzing mixed carbon nanotube bundles A current density study.

New designs of Redundant%2DBinary full Adders and its applications.

The Development and Application of Quick Search Engine Based on Special Fields.

Topology variety model for mobile ad hoc networks.

A Bayesian knowledge engineering framework for service management.

Cooperative Communication System for Parallel Computing Agents in Multi%2Dcluster Grid.

3D CMOL Crossnet for Neuromorphic Network Applications.

FPAA Based on Integration of CMOS and Nanojunction Devices for Neuromorphic Applications.

Exploring Multi%2Dlayer Graphene Nanoribbon Interconnects.

Prediction of Syngas Compositions in Texaco Coal Gasification Process Using Robust Neural Estimator.

A Dynamic Group Blind Signature Scheme Based on Elliptic Curve.

Optimization of Multi%2DProject in Limited Resources on the Basis of Improved Genetic Algorithm.

Study of Index Weight in Network Threat Evaluation Based on Improved Grey Theory.

Limited feedback Zero Forcing precoding scheme for MIMO%2Dbroadcast channels.

The Synchronization Technique of Data Fusion for Integrated Navigation Systems.

An Intelligent Ontology and Bayesian Network Based Semantic Mashup for Tourism.

An Extension to Pointer Logic for Verification.

A Flexible Tree Searching Scheme for MIMO Detection.

Spokesmen Election Problem Revisited.

Efficient Processing of Complex Twig Pattern Matching.

REC A Novel Model to Rank Experts in Communities.

Towards a flexible business process modeling and simulation environment.

Simulating order fulfillment and supply planning for a vertically aligned industry solution business.

An introduction to IBM General Business Simulation Environment.

A Graph Based Approach Toward Network Forensics Analysis.

Simple transformation functions for finding better minima.

Delay%2Ddependent stability for discrete systems with large delay sequence based on switching techniques.

GBNet Deciphering regulatory rules in the co%2Dregulated genes using a Gibbs sampler enhanced Bayesian network approach.

Prediction of regulatory elements in mammalian genomes using chromatin signatures.

Information%2Dtheoretic limits on sparse signal recovery Dense versus sparse measurement matrices
We study the information-theoretic limits of exactly recovering the support of a sparse signal using noisy projections defined by various classes of measurement matrices. Our analysis is high-dimensional in nature, in which the number of
observations n, the ambient signal dimension p, and the signal
sparsity k are all allowed to tend to infinity in a general manner. This paper makes two novel contributions. First, we provide sharper necessary conditions for exact support recovery using general (non-Gaussian) dense measurement matrices. Combined with previously known sufficient conditions, this result yields a sharp characterization of when the optimal decoder can recover a signal with linear sparsity (k = Θ(p)) using a linear scaling of observations (n = Θ(p)) in the presence of noise. Our second contribution is to prove necessary conditions on the number
of observations n required for asymptotically reliable recovery using a class of γ-sparsified measurement matrices, where the measurement sparsity γ(n, p, k) G (0, 1] corresponds to the fraction of non-zero entries per row. Our analysis allows general scaling of the quadruplet (n, p, k, γ), and reveals three different regimes, corresponding to whether measurement sparsity has no effect, a minor effect, or a dramatic effect on the information-theoretic limits of the subset recovery problem.
Characterization of graphs with infinite cyclic edge connectivity.

Countermeasures for Hardware Fault Attack in Multi%2DPrime RSA Cryptosystems.

Adaptive Broadcasting for Similarity Queries in Wireless Content Delivery Systems.

Sample average approximation of expected value constrained stochastic programs.

A General Internal Model Approach for Motion Learning.

Stability Analysis for Linear Switched Systems With Time%2DVarying Delay.

Improved Clonal Selection Algorithm Combined with Ant Colony Optimization.

PERT a new power%2Defficient real%2Dtime packet delivery scheme for sensor networks.
  We present PERT, a power-efficient scheme to deliver real-time data packets in sensor networks. Time-sensitive sensor data is common in applications such as hazard monitoring systems, traffic control systems and battlefield command systems. Such data are associated with end-to-end deadlines, within which they must reach the base station. We make two contributions in this work. First, we propose a novel loadbalanced routing scheme that distributes data packets evenly among the nodes relaying data towards the base station, avoiding bottlenecks and increasing the likelihood that packets will meet their deadlines. Second, we propose a method of grouping smaller packets into larger ones by delaying data transmissions at the relaying nodes whenever slack times are positive. Our packet grouping scheme significantly reduces packet transmissions, reduces congestion, and saves power in the sensor network. We verify the effectiveness of our approach through extensive simulations of wireless network
Force cooperation in a reconfigurable field multirobot system.

Sample average approximation of expected value constrained stochastic programs.

Design and implementation of Log%2DGabor filter in fingerprint image enhancement.

Nanoparticle%2Dbased lift%2Doff technique for ultra%2Dthin nanoporous film preparation.

Advances in Web and Network Technologies

Mining repetitive clips through finding continuous paths.
Automatically discovering repetitive clips from large video database is a challenging problem due to the enormous computational cost involved in exploring the huge solution space. Without any a priori knowledge of the contents, lengths and total number of the repetitive clips, we need to discover all of them in the video database. To address the large computational cost, we propose a novel method which translates repetitive clip mining to the continuous path finding problem in a matching trellis, where sequence matching can be accelerated by taking advantage of the temporal redundancies in the videos. By applying the locality sensitive hashing (LSH) for efficient similarity query and the proposed continuous path finding algorithm, our method is of only quadratic complexity of the database size. Experiments conducted on a 10.5-hour TRECVID news dataset have shown the effectiveness, which can discover repetitive clips of various lengths and contents in only 25 minutes, with features extracted off-line.
Energy Efficient Multi%2Drate Based Time Slot Pre%2Dschedule Scheme in WSNs for Ubiquitous Environment.

Active Rules Termination Analysis Through Conditional Formula Containing Updatable Variable.

Bayesian Method Based Trusted Overlay for Information Retrieval over Networks.

EviRank An Evidence Based Content Trust Model for Web Spam Detection.

A Novel Factoid Ranking Model for Information Retrieval.

An efficient algorithm for approximate biased quantile computation in data streams.

A Note on Shacham and Waters Ring Signatures.

An Efficient Survivability Hierarchy Analysis Model for Networked Information System.

A Quantitative Evaluation Model for Network Security.

A New Method Considering Creditability Degree and Connection of Buyers and Sellers in E%2DBroker System.

Reliable Self%2DClustering P2P Overlay Networks.

MSFSS A Storage System for Mass Small Files.

Hardware%2DSoftware Co%2Ddesign for Dynamic Reconfigurable Computing with Collaborative Supports of Architecture and Operating System.

Analyzing Co%2Dtraining Style Algorithms.
Abstract. Co-training is a semi-supervised learning paradigm which trains two learners respectively from two different views and lets the learners label some unlabeled examples for each other. In this paper, we present a new PAC analysis on co-training style algorithms. We show that the co-training process can succeed even without two views, given that the two learners have large difference, which explains the success of some co-training style algorithms that do not require two views. Moreover, we theoretically explain that why the co-training process could not improve the performance further after a number of rounds, and present a rough estimation on the appropriate round to terminate co-training to avoid some wasteful learning rounds. 1
Loss Tomography in Wireless Sensor Network Using Gibbs Sampling.

Genetically generated double%2Dlevel fuzzy controller with a fuzzy adjustment strategy.

Performance and power evaluation of a 3D CMOS%2Fnanomaterial reconfigurable architecture.

WMQ Towards A Fine%2Dgrained QoS Control for E%2DBusiness Servers.

Face Recognition Based on Binary Template Matching.

A New Immune PID Controller Based on Immune Tuning.

Impact of Business Service Modes on Distribution Systems A Reinforcement Learning Approach.

A Novel Approach for Process Mining Based on Event Types.
Despite the omnipresenceof event logs in transactional infII mation systems (cf WFM, ERP, CRM, SCM, and B2B systems), historic infricNAO] is rarely used to analyze the underlying processes. Process mining aims at improving this by providing techniques and tools fN discovering process, control, data, organizational, and social structures fuc event logs, i.e., the basic idea of process mining is to diagnose business processes by mining event logsfg knowledge. Given its potential and challenges it is no surprise that recently process mining has become a vivid research area [5, 6]. In this paper, a novel approachfA process mining based on two event types, i.e., START and COMPLETE, is proposed. InfN633A1N about the start and completionof tasks can be used to explicitly detect parallelism. The algorithm presented in this paper overcomes some of the limitationsof existing algorithms such as the #-  algorithm (e.g., short-loops) and theref5N enhances the applicability of process mining. 1 
A Method to Enhance Service Survivability Based on Autonomous Configuration.

Distributed sparse random projections for refinable approximation.
berkeley.edu Consider a large-scale wireless sensor network measuring compressible data, where n distributed data values can be well-approximated using only k ≪ n coefficients of some known transform. We address the problem of recovering an approximation of the n data values by querying any L sensors, so that the reconstruction error is comparable to the optimal k-term approximation. To solve this problem, we present a novel distributed algorithm based on sparse random projections, which requires no global coordination or knowledge. The key idea is that the sparsity of the random projections greatly reduces the communication cost of pre-processing the data. Our algorithm allows the collector to choose the number of sensors to query according to the desired approximation error. The reconstruction quality depends only on the number of sensors queried, enabling robust refinable approximation.
F%26A compensating variable bang%2Dbang control algorithm for pneumatic driving glass%2Dwall cleaning robot.

Molecular Tomographic Imaging of Lymph Nodes with Nir Fluorescence.
This contribution describes a system and method for tomographically imaging lymph nodes marked with a lymph endothelium targeting fluorescence reporter. A novel scanning NIR laser line source was employed to acquire multiple sets of boundary fluorescence measurements in the groin region of a Yorkshire swine. The source light shaped into a linear profile was modulated at 100MHz and a gain modulated homodyne ICCD detection system was used to collect area measurements of fluorescence amplitude and phase on the illumination plane. Multiple measurement data sets generated by scanning the excitation sources were processed simultaneously to generate the interior fluorescence distribution in tissue by implementing a parallelized dual adaptive finite element based fluorescence tomography algorithm. Three dimensional localization of the approximately 2.5cm deep inguinal lymph node in the swine groin following injection of 100μL of a lymph targeting Hyaluronan-Indocyanine Green conjugate dye is demonstrated. 1.
Fault Tolerance Circuit for AM%2DOLED.

Appearance%2DBased Map Learning for Mobile Robot by Using Generalized Regression Neural Network.

Soft%2DSensor Method Based on Least Square Support Vector Machines Within Bayesian Evidence Framework.

Space%2Dfrequency precoding scheme for multiuser MIMO%2DOFDM systems.

A Kernel Matching Pursuit Approach to Man%2DMade Objects Detection in Aerial Images.

Simulating Trust Overlay in P2P Networks.

Data Management Services in ChinaGrid for Data Mining Applications.

Factoid Mining Based Content Trust Model for Information Retrieval.

A Trust%2DOriented Heuristic Scheduling Algorithm for Grid Computing.

A QoS%2DEnabled WorkManager Model for Web Application Servers.

Using Rough Reducts to Analyze the Independency of Earthquake Precursory Items.

Robust Routing and Scheduling in Wireless Mesh Networks.
Abstract — Joint routing-and-scheduling has been considered in wireless mesh networks for its significant performance improvement. While existing work assumes it, accurate traffic information is usually not available due to traffic dynamics, as well as inaccuracy and delay in its measurement and dissemination. In addition, the joint routing and scheduling usually requires a centralized controller to calculate the optimal routing and scheduling and distribute such policies to all the nodes. Thus, even if the accurate traffic information is always available, the central controller has to compute the routing and scheduling repeatedly because the traffic demands change continuously. This leads to prohibitive computation and distribution overhead. Therefore, in this paper, we propose a joint routing-scheduling scheme that achieves robust performance under traffic information uncertainty. In particular, it achieves worst-case optimal performance under a range of traffic conditions. This unique feature validates the use of centralized routing and scheduling in wireless mesh networks. As long as the traffic variation is within the estimation range, the routing and scheduling do not need to be recomputed and redistributed. Our simulation shows that the proposed scheme achieves very good average performance under a large error margin on traffic estimation and is robust when the estimation largely deviates from the actual traffic patterns. Our scheme provides insights on the desired properties of multipath routing, namely, spatial reuse and load balancing. I.
An Efficient Algorithm for Mining Coherent Patterns from Heterogeneous Microarrays.

Security Based Heuristic SAX for XML Parsing.

Noncooperative Power Control Game with Exponential Pricing for Cognitive Radio Network.

IBM supply%2Dchain network optimization workbench an integrated optimization and simulation tool for supply chain design.
The IBM Supply-chain Network Optimization Workbench (SNOW) is a software tool that can help a company make strategic business decisions about the design and operation of its supply chain network. The tool supports supply chain analysis with integrated network optimization and simulation capability. Mathematical programming models are used to first help identify some cost-effective scenarios from a large number of candidates. Optimization results are then converted to simulation models automatically for more detailed analysis with taking into account operational policies and uncertainties. The tool was applied to analyze both IBM’s internal supply chains and external clients’ supply chains. The combination of optimization and simulation demonstrates great value in real business cases. 1
IFAO%2DSIMO a spatial%2Dsimulation based facility network optimization framework.

Discrete event simulation modeling of resource planning and service order execution for service businesses.
In this paper, we present a framework for developing discrete-event simulation models for resource-intensive service businesses. The models simulate interactions of activities of demand planning of service engagements, supply planning of human resources, attrition of resources, termination of resources and execution of service orders to estimate business performance of resource-intensive service businesses. The models estimate serviceability, costs, revenue, profit and quality of service businesses. The models are also used in evaluating effectiveness of various resource management analytics and policies. The framework is aided by an information meta-model, which componentizes modeling objects of service businesses and allows effective integration of the components. 1


Two parallel distribution algorithms for convex constrained minimization problems.

Delay and its time%2Dderivative dependent robust stability of neutral control system.

On the definable ideal generated by the plus cupping c.e. degrees.

High%2Dthroughput identification of interacting protein%2Dprotein binding sites.

On the detection of functionally coherent groups of protein domains with an extension to protein annotation.

A Multiparty Videoconferencing System Over an Application%2DLevel Multicast Protocol.

Data management services and transfer scheme in ChinaGrid.

Adaptive fuzzy control for a class of uncertain nonaffine nonlinear systems.

Approaches to the representations and logic operations of fuzzy concepts in the framework of axiomatic fuzzy set theory I.

Approaches to the representations and logic operations of fuzzy concepts in the framework of axiomatic fuzzy set theory II.

Leakage Current Optimization Techniques During Test Based on Don%27t Care Bits Assignment.

Constraint%2Dbased sequential pattern mining the pattern%2Dgrowth methods.
Constraints are essential for many sequential pattern mining applications. However, there is no systematic study on constraint-based sequential pattern mining. In this paper, we investigate this issue and point out that the framework developed for constrained frequent-pattern mining does not fit our mission well. An extended framework is developed based on a sequential pattern growth methodology. Our study shows that constraints can be effectively and efficiently pushed deep into the sequential pattern mining under this new framework. Moreover, this framework can
be extended to constraint-based structured pattern mining as well.
Approximate range%2Dsum query answering on data cubes with probabilistic guarantees.

High%2Dmobility pentacene thin%2Dfilm transistors with copolymer%2Dgate dielectric.

Geometric Separators and Their Applications to Protein Folding in the HP%2DModel.

Trusted dynamic level scheduling based on Bayes trust model.

Advanced Web and Network Technologies

Mining the Useful Skyline Set Based on the Acceptable Difference.

Grid Service Based Parallel Debugging Environment.

Identifying Intrusions in Computer Networks with Principal Component Analysis.
Most current anomaly Intrusion Detection Systems (IDSs) detect computer network behavior as normal or abnormal but cannot identify the type of attacks. Moreover, most current intrusion detection methods cannot process large amounts of audit data for real-time operation. In this paper, we propose a novel method for intrusion identification in computer networks based on Principal Component Analysis (PCA). Each network connection is transformed into an input data vector. PCA is employed to reduce the dimensionality of the data vectors and identification is handled in a low dimensional space with high efficiency and low use of system resources. The normal behavior is profiled based on normal data for anomaly detection and models of each type of attack are built based on attack data for intrusion identification. The distance between a vector and its reconstruction onto those reduced subspaces representing the different types of attacks and normal activities is used for identification. The method is tested with network data from MIT Lincoln labs for the 1998 DARPA Intrusion Detection Evaluation Program and testing results show that the model is promising in terms of identification accuracy and computational efficiency for real-time intrusion identification. 1.
A Semantic Reputation Mechanism in P2P Semantic Web.

Ternary Tree Based Group Key Management in Dynamic Peer Networks.

Fuzziness Driven Adaptive Sampling for Monte Carlo Global Illuminated Rendering.

Stochastically Consistent Caching and Dynamic Duty Cycling for Erratic Sensor Sources.

Visual Specification and Optimization of XQuery Using VXQ.

A Novel Incremental Maintenance Algorithm of SkyCube.

SPMT Statistical Machine Translation with Syntactified Target Language Phrases.
We introduce SPMT, a new class of statistical Translation Models that use Syntactified target language Phrases. The SPMT models outperform a state of the art phrase-based baseline model by 2.64 Bleu points on the NIST 2003 Chinese-English test corpus and 0.28 points on a humanbased quality metric that ranks translations on a scale from 1 to 5. 1
Ant%2Dbased Reputation Evidence Distribution in P2P Networks.

A Grid Resource Price%2Dadjusting Strategy Based on Price Influence Model.

Adaptive sampling based on fuzzy inference.

An Autonomous Trust Construction System Based on Bayesian Method.

Extraction of Stable Points from Fingerprint Images Using Zone Could%2Dbe%2Din Theorem.

Gradual Cube Customize Profile on Mobile OLAP.

Proposal of Incremental Sliding Mode Control.

Ocean Red Tide Recognizing Method Based Neural Network Ensembles.

A Registration Method of Fundus Images Based on Edge Detection and Phase%2DCorrelation.

Height Reconstruction in Highly Sloped Area Using Multi%2Dfrequency InSAR Data.

Fingerprint Minutiae Matching Based on Coordinate System Bank and Global Optimum Alignment.

Improved Algorithm for Adaboost with SVM Base Classifiers.

ANN Based Internal Model Approach to Motor Learning for Humanoid Robot.

Random distributed multiresolution representations with significance querying.
We propose random distributed multiresolution representations of sensor network data, so that the most significant encoding coefficients are easily accessible by querying a few sensors, anywhere in the network. Less significant encoding coefficients are available by querying a larger number of sensors, local to the region of interest. Significance can be defined in a multiresolution way, without any prior knowledge of the source data, as global summaries versus local details. Alternatively, significance can be defined in a dataadaptive way, as large differences between neighboring data values. We propose a distributed encoding algorithm that is robust to arbitrary wireless communication connectivity graphs, where links can fail or change with time. This randomized algorithm allows distributed computation that does not require strict global coordination or awareness of network connectivity at individual sensors. Because computations involve sensors in local neighborhoods of the communication graph, they are communication-efficient. Our framework uses local interaction among sensors to enable flexible information retrieval at the global level.
Passive reduced%2Dorder macromodeling algorithm for structure dynamics in MEMS systems.

Autonomous Control for Micro%2DFlying Robot and Small Wireless Helicopter X.R.B.

Locomotion Capabilities of a Novel Reconfigurable Robot with 3 DOF Active Joints for Rugged Terrain.

A frequency estimation algorithm for ADPLL designs with two%2Dcycle lock%2Din time.

A portable all%2Ddigital pulsewidth control loop for SOC applications.

An efficient adaptive interlace%2Dto%2Dprogressive scan conversion scheme and hardware implementation.

Exploring carbon nanotubes and NiSi nanowires as on%2Dchip interconnections.

Logic optimization for majority gate%2Dbased nanoelectronic circuits.

Passive reduced%2Dorder macromodeling algorithm for structure dynamics in MEMS systems.

Robust Adaptive Neural Network Control for a Class of Nonlinear Systems.

Traffic Volume Forecasting Based on Wavelet Transform and Neural Networks.

Estimation of the Future Earthquake Situation by Using Neural Networks Ensemble.

Adaptive Neural Network Control for Nonlinear Systems Based on Approximation Errors.

Nonlinear System Adaptive Control by Using Multiple Neural Network Models.

An Architecture and Programming Framework for Dynamic Reconfigurable Computing Systems.

Lossy Node Identification in Wireless Sensor Network.

Diffusion and graph spectral methods for network forensic analysis.

A Generic Trust Overlay Simulator for P2P Networks.

A Reputation Multi%2Dagent System in Semantic Web.

Research on Performance Test and Evaluation Method of Assembly Packaging Ammunition.

Generalized Rake Receiver for Spreading%2DIFDMA Systems.

A Method for Robustness Improvement of Robot Obstacle Avoidance Algorithm.

Target Tracking in Colored Image Sequence Using Weighted Color Histogram Based Particle Filter.

Building and Understanding Robotics%3Fa Practical Course for Different Levels Education.

Design and Realization of a Novel Reconfigurable Robot with Serial and Parallel Mechanisms.

Large%2Dscale Topological Environmental Model Based Particle Filters for Mobile Robot Indoor Localization.

Passage Retrieval by Shrinkage of Language Models.

Performance of an Adaptive Multiuser OFDM Uplink with Carrier Frequency Offsets.

Central Nervous Processing for Acupuncture at Liv3 with fMRI A Preliminary Experience.

Linking strategic objectives to operations towards a more effective supply chain decision making.

Applying simulation in a supply chain transformation case.

IBM SmartSCOR %2D a SCOR based supply chain transformation platform through simulation and optimization techniques.

Blow%2Dup rate for a nonlinear diffusion equation.

Learning Portfolio Analysis and Mining for SCORM Compliant Environment.
Abstract- With vigorous development of the Internet, elearning system has become more and more popular. Sharable Content Object Reference Model (SCORM) 1.3 provides the Sequencing and Navigation to define the course sequencing behavior, control the sequencing, select and deliver of course, and organize the content into a hierarchical structure, namely Activity Tree. Therefore, how to provide customized course according to individual learning characteristics and capability, and how to create, represent and maintain the activity tree with appropriate associated sequencing definition for different learners become two important issues. However, it is almost impossible to design personalized learning activities trees for each learner manually. The information of learning behavior, called learning portfolio, can help teacher understand the reason why a learner got high or low grade. Thus, in this paper, we propose a Learning Portfolio Mining (LPM) Approach including four phase: 1. User Model Definition Phase: define the learner profile based upon pedagogical theory. 2. Learning Pattern Extraction Phase: apply sequential pattern mining technique to extract the maximal frequent learning patterns from the learning sequence, transform original learning sequence into a bit vector, and then use distance based clustering approach to group learners with good learning performance into several clusters. 3. Decision Tree Construction Phase: use two third of the learner profiles with corresponding cluster labels as training data to create a decision tree, and the remaining are the testing data. 4. Activity Tree Generation Phase: use each created cluster including several learning patterns as sequencing rules to generate personalized activity tree with associated sequencing rules of SN. Finally, for evaluating our proposed approach of learning portfolio analysis, several experiments have been done and the results show that generated personalized activity trees with sequencing rules are workable for learners.
A sufficient condition for a family of graphs being determined by their generalized spectra.

Design of IIR orthogonal wavelet filter banks using lifting scheme.

System deep usage in post%2Dacceptance stage a literature review and a new research framework.

A New Computational Way to Monte Carlo Global Illumination.

Hybrid Nanoelectronics Future of Computer Technology.

Risk and confidence analysis for fuzzy multicriteria decision making.

Extracting semantic concepts from images a decisive feature pattern mining approach.

Kalman filtering for time%2Ddelayed linear systems.

Two%2Dprime RSA immune cryptosystem and its FPGA implementation.

Building Evidence Graphs for Network Forensics Analysis.

Joint Spatial and Frequency Domains Watermarking Algorithm Based on Wavelet Packets.

Grid%2DODF Detecting Outliers Effectively and Efficiently in Large Multi%2Ddimensional Databases.

Stay Current and Relevant in Data Mining Research.

Network Forensics Analysis with Evidence Graphs.
We develop a prototype network forensics analysis tool that integrates presentation, manipulation and automated reasoning of intrusion evidence. We propose the evidence graph as a novel graph model to facilitate the presentation and manipulation of intrusion evidence. For automated evidence analysis, we develop a hierarchical reasoning framework that includes local reasoning and global reasoning. In local reasoning, we apply Rule-based Fuzzy Cognitive Maps (RBFCM) to model the state evolution of suspicious hosts. In global reasoning, we aim to identify group of strongly correlated hosts in the attack and derive their relationships in the attack scenario. Our analysis mechanism effectively integrates analyst feedbacks into the automated reasoning process. Experimental results demonstrate the potential of our proposed techniques.
A Color Indexing Scheme Using Two%2Dlevel Clustering Processing for Effective and Efficient Image Retrieval.

Parallel Web Spiders for Cooperative Information Gathering.
Abstract. Web spider is a widely used approach to obtain information for search engines. As the size of the Web grows, it becomes a natural choice to parallelize the spider’s crawling process. This paper presents a parallel web spider model based on multi-agent system for cooperative information gathering. It uses the dynamic assignment mechanism to wipe off redundant web pages caused by parallelization. Experiments show that the parallel spider is effective to improve the information gathering performance within an acceptable interaction efficiency cost for controlling. This approach provides a novel perspective for the next generation advanced search engine. 1
Towards a Framework for Automatic Service Composition in Manufacturing Grid.

Sketch Parameterization Using Curve Approximation.
Abstract. This paper presents a method of parameterization for online freehand drawing objects based on a piecewise cubic Bezier curve approximation. The target is to represent sketches in a compact format within a certain error tolerance with lower computation to be practically adaptable for the online graphics input. A set of user’s intended breakpoints in digital ink is firstly produced in terms of pen speed and local curvatures. Each of strokes of a skechy shape is then parameterized by the optimization of piecewise Bezier curve approximation to minimize the fitting error between stroke path and the curve. The experimental results show both effective and efficient for a wide range of drawing graphic objects. 1
Industry Track Refining production strategy optimization model based on mixed bi%2Dlevel programming method.

A Novel Approach to Ocular Image Enhancement with Diffusion and Parallel AOS Algorithm.

Locating Human Eyes Using Edge and Intensity Information.

Performance comparison of quantum%2Ddot cellular automata adders.

Efficient multi%2Dprime RSA immune against hardware fault attack.

A scalable DCO design for portable ADPLL designs.

Multisensors Information Fusion with Neural Networks for Noninvasive Blood Glucose Detection.

Adaptive Fingerprint Enhancement by Combination of Quality Factor and Quantitative Filters.

Efficient Group Key Management for Dynamic Peer Networks.

TP%2DTree a Query Workload%2DAdaptive Synopsis for Fast OLAP Applications.

A Policy%2Dbased Resource Monitoring System in Distributed Computing Environmen.

Design Pattern Detection in Eiffel Systems.

XAR%2Dminer efficient association rules mining for XML data.

X%2Dwarehouse building query pattern%2Ddriven data.

Conic functions on metric spaces and their application.

An Efficient Algorithm for Cyclic Edge Connectivity of Regular Graphs.

Kalman filtering for multiple time%2Ddelay systems.

Progress in the development and application of computational methods for probabilistic protein design.

Bifurcation
Under consideration for publication in J. Fluid Mech. 1 Transition from ciliary to flapping mode in a swimming mollusc: flapping flight as a
Comments on %22Research on estimating smoothed value and differential value by using sliding mode system%22.

The fuzzy clustering analysis based on AFS theory.

Preference%2DBased Frequent Pattern Mining.

Scalable molecular dynamics with NAMD.

A Transparent Rate Adaptation Algorithm for Streaming Video over the Internet.

SE4SC A Specific Search Engine for Software Components.
Currently Component-based software engineering is increasingly being adopted for software development. This approach relies on using reusable components as the building blocks for constructing software systems. As the growth in the popularity of Internet, component providers can publish the components easily on the Internet. Therefore, the major problem facing the component reusers is to find suitable components on the Internet. The solution to this problem lies in applying search engine technology. However, general-purpose search engines are inappropriate to search for software components. Some people developed the specific search engines for software components. But those engines have some limitations. This paper proposes a new specific search engine for software components, which provides convenient support for component reusers to search for software components on the Internet. 1.
An Bayesian Method for Biological Pathway Discovery from High%2DThroughput Experimental Data.

Very Large Scale Multidimensional Data Management and Retrieval for USGS and NIMA Imagery.

Optimization of in%2Dnetwork data reduction.
We consider the in-network computation of approximate &#034;big picture&#034; summaries in bandwidth-constrained sensor networks. First we review early work on computing the Haar wavelet decomposition as a User-Defined Aggregate in a sensor query engine. We argue that this technique can be significantly improved by choosing a function-specific network topology. We generalize this discussion to a loose definition of a 2-level optimization problem that maps from a function to what we call a support graph for the function, and from there to an aggregation tree that is chosen from possible subgraphs of the physical network connectivity. This work is frankly quite preliminary: we raise a number of questions but provide relatively few answers. The intent of the paper is to lay groundwork for discussion and further research.
Answering Approximate Range Aggregate Queries on OLAP Data Cubes with Probabilistic Guarantees.

Improving Word Alignment Models using Structured Monolingual Corpor.

HARC A Homogeneous Architecture reconfigurable Computer.

Ad Hoc Debugging Environment for Grid Applications.

PGMS A P2P%2DBased Grid Monitoring System.

Network Performance Measurement Methodologies in PGMS.

A 2O%28n1%2D%281%2Fd%29log n%29 Time Algorithm for d%2DDimensional Protein Folding in the HP%2DModel.

Stochastic power control algorithm in CDMA systems.

Optimal filtering for discrete time%2Dvarying systems with multiple time%2Ddelay measurements.

Decoupling control and feedback linearization for a class of nonlinear time%2Ddelay systems.

Design of iir orthogonal wavelet filter banks using lifting scheme.

Locatization of human eyes based on a series of binary images.

Adaptive Data Broadcasting in Asymmetric Communication Environments.

Powder%2Dbased fabrication techniques for single%2Dwall carbon nanotube circuits.

A multiplex%2Dmulticast scheme that improves system capacity of voice%2Dover%2DIP on wireless LAN by 100%25.

Modeling Dynamic System by Recurrent Neural Network with State Variables.

A Novel Individual Blood Glucose Control Model Based on Mixture of Experts Neural Networks.

Visual Search in Alzheimer%27s Disease %2D fMRI Study.

Grid%2DEnabled Parallel Debugging Environment A Portal Solution.

An Immune CRT%2DBased Three%2Dprime RSA cryptosystem.

DPVK %2D An Eclipse Plug%2Din to Detect Design Patterns in Eiffel Systems.

Easy%2DSC A Supply Chain Simulation Tool.

Statistical Machine Translation by Parsing
In an ordinary syntactic parser, the input is a string, and the grammar ranges over strings. This paper explores generalizations of ordinary parsing algorithms that allow the input to consist of string tuples and/or the grammar to range over string tuples. Such algorithms can infer the synchronous structures hidden in parallel texts. It turns out that these generalized parsers can do most of the work required to train and apply a syntax-aware statistical machine translation system.
DPVK %2D An Eclipse Plug%2Din to Detect Design Patterns in Eiffel Systems.

Observer%2Dbased adaptive fuzzy control for SISO nonlinear systems.

Reminiscences on Influential Papers %2D Kenneth A. Ross.

Constraint Shape Model Using Edge Constraint and Gabor Wavelet Based Search.
Abstract: Constraint Shape Model is proposed to extract facial feature using two different search methods for contour points and control points individually. In the proposed algorithm, salient facial features, such as the eyes and the mouth, are first localized and utilized to initialize the shape model and provide region constraints on iterative shape searching. For the landmarks on the face contour, the edge intensity is exploited to construct better local texture matching models. Moreover, for control points, the proposed Gabor wavelet based method is used to search it by multi-frequency strategy. To test the proposed approaches, on a database containing 500 labeled face images, experiments are conducted, which shows that the proposed method performs significantly better in terms of a deliberate performance evaluation method. The proposed method can be easily used to other texture objects, which is robust to variations in illumination and facial expression.
A Novel Scheme for Video Similarity Detection.
Abstract. In this paper, a new two-phase scheme for video similarity detection is proposed. For each video sequence, we extract two kinds of signatures with different granularities: coarse and fine. Coarse signature is based on the Pyramid Density Histogram (PDH) technique and fine signature is based on the Nearest Feature Trajectory (NFT) technique. In the first phase, most of unrelated video data are filtered out with respect to the similarity measure of the coarse signature. In the second phase, the query video example is compared with the results of the first phase according to the similarity measure of the fine signature. Different from the conventional nearest neighbor comparison, our NFT based similarity measurement method well incorporates the temporal order of video sequences. Experimental results show that our scheme achieves better quality results than the conventional approach. 1
SemView A Semantic%2Dsensitive Distributed Image Retrieval System.
State-of-the-art image retrieval techniques have been developed to support high-level (semantics) querying and browsing of images. For certain user queries, it is also very important to know about the information about the remote image databases on the Internet so that the queries can be guided toward the most relevant databases. In this paper, we introduce a novel system, SemView, which supports both visual and semantic queries and intelligently ranks the distributed image databases for the queries. Our system summarizes the visual and semantic contents of each database in a metadatabase, which is a collection of automatically generated visual, semantic and statistical metadata. With the metadatabase, our system can effectively guide the user queries toward the most relevant image databases in a distributed environment for better retrieval performance.
Grid Workflow Based on Performance Evaluation.

Theoretical Analysis of Simple Evolution Strategies in Quickly Changing Environments.

Beyond Supervised Learning of Wrappers for Extracting Information from Unseen Web Sites.

Enhanced Active Shape Models with Global Texture Constraints for Image Analysis.
Abstract. Active Shape Model (ASM) has been widely recognized as one of the best methods for image understanding. In this paper, we propose to enhance ASMs by introducing global texture constraints expressed by its reconstruction residual in the texture subspace. In the proposed method, each landmark is firstly matched by its local profile in its current neighborhood, and the overall configure of all the landmarks is re-shaped by the statistical shape constraint as in the ASMs. Then, the global texture is warped out from the original image according to the current shape model, and its reconstruction residual from the pre-trained texture subspace is further exploited to evaluate the fitting degree of the current shape model to the novel image. Also, the texture is exploited to predict and update the shape model parameters before we turn to the next iterative local matching for each landmark. Our experiments on the facial feature analysis have shown the effectiveness of the proposed method.
EVolve An Open Extensible Software Visualisation Framework.

Policy Storage for Role%2DBased Access Control Systems.
Role-based access control has been a focal area for many security researchers over the last decade. There have been a large number of models, and many rich specification languages. However there has been little attention paid to the way in which access control policy is stored persistently. This paper investigates policy storage from the perspective of access control to the policy itself, and of its distributed administration.
Factorization of Language Models through Backing%2DOff Lattices

Web Discovery and Filtering Based on Textual Relevance Feedback Learning.

Approach to the Correlation Discovery of Chinese Linguistic Parameters Based on Bayesian Method.

Innovative control education using a low cost intelligent robot platform.

Microarray image compression SLOCO and the effect of information loss.
Microarray image technology is a powerful tool for monitoring the expression of thousands of genes simultaneously. Each microarray experiment produces immense amounts of image data, and ecient storage and transmission require compression that takes advantage of microarray image structure. In this paper we develop a compression scheme for microarray images which can be either lossless or lossy with successive re  nements. Existing measures of distortion such as mean squared pixel-wise error and visual  delity are not appropriate for microarray images. We introduce a new measure of distortion for lossy compression: the sensitivity of microarray information extraction to compression loss. Furthermore, our scheme has a coded data structure that allows fast decoding and reprocessing of image sub-blocks, and includes summary statistics and image segmentation information.
Automatic Annotation and Retrieval of Images.
We propose a novel approach for semantics-based image annotation and retrieval. Our approach is based on monotonic tree, a derivation of contour tree for discrete data. Monotonic tree provides a way to bridge the gap between the high-level semantics and low-level features. Each branch (subtree) of the monotonic tree is termed as a structural element if its area is within a given scale. The structural elements are classified and clustered based on their low level features such as color, spatial location, harshness, and shape. Each cluster corresponds to some semantic feature. The category keywords indicating the semantic features are automatically annotated to the images. Based on the semantic features extracted from images, high-level (semantics-based) querying and browsing of images can be achieved. The experimental results demonstrate the effectiveness of our approach.
Mining sequential patterns with constraints in large databases.
Constraints are essential for many sequential pattern mining applications. However, there is no systematic study on constraint-based sequential pattern mining. In this paper, we investigate this issue and point out that the framework developed for constrained frequent-pattern mining does not fit our missions well. An extended framework is developed based on a sequential pattern growth methodology. Our study shows that constraints can be effectively and efficiently pushed deep into sequential pattern mining under this new framework. Moreover, this framework can be extended to constraint-based structured pattern mining as well.
Semantics%2DBased Image Retrieval by Region Saliency.
Abstract. We propose a new approach for semantics-based image retrieval. We use color-texture classification to generate the codebook which is used to segment images into regions. The content of a region is characterized by its self-saliency and the lower-level features of the region, including color and texture. The context of regions in an image describes their relationships, which are related to their relative-saliencies. High-level (semantics-based) querying and query-by-example are supported on the basis of the content and context of image regions. The experimental results demonstrate the effectiveness of our approach. 1
Structure Alignment Using Bilingual Chunking.
chunking&#034; for structure alignment is proposed. Different with the existing approaches which align hierarchical structures like sub-trees, our method conducts alignment on chunks. The alignment is finished through a simultaneous bilingual chunking algorithm. Using the constrains of chunk correspondence between source language (SL) and target language (TL), our algorithm can dramatically reduce search space, support time synchronous DP algorithm, and lead to highly consistent chunking. Furthermore, by unifying the POS tagging and chunking in the search process, our algorithm alleviates effectively the influence of POS tagging deficiency to the chunking result.
Webview A Distributed Geographical Image Retrieval System.

Compression of cDNA and inkjet microarray images.

An Improved Active Shape Model for Face Alignment.
In this paper, we present several improvements on the conventional Active Shape Models (ASM) for face alignment. Despite the accuracy and robustness of the ASMs in the image alignment, its performance depends heavily on the initial parameters of the shape model, as well as the local texture model for each landmark and the corresponding local matching strategy. In this work, to improve the ASMs for face alignment, several measures are taken. First, salient facial features, such as the eyes and the mouth, are localized based on a face detector. These salient features are then utilized to initialize the shape model and provide region constraints on the subsequent iterative shape searching. Secondly, we exploit the edge information to construct better local texture models for the landmarks on the face contour. The edge intensity at the contour landmark is used as a selfadaptive weight when calculating the Mahalanobis distance between the candidate profile and the reference one. Thirdly, to avoid their unreasonable shift from the pre-localized salient features, landmarks around the salient features are adjusted before applying the global subspace constraints. Experiments on a database containing 300 labeled face images show that the proposed method performs significantly better than traditional ASMs.
Highly efficient simulation environment for HDTV video decoder in VLSI design.

Automatic Annotation and Retrieval of Images.
We propose a novel approach for semantics-based image annotation and retrieval. Our approach is based on monotonic tree, a derivation of contour tree for discrete data. Monotonic tree provides a way to bridge the gap between the high-level semantics and low-level features. Each branch (subtree) of the monotonic tree is termed as a structural element if its area is within a given scale. The structural elements are classified and clustered based on their low level features such as color, spatial location, harshness, and shape. Each cluster corresponds to some semantic feature. The category keywords indicating the semantic features are automatically annotated to the images. Based on the semantic features extracted from images, high-level (semantics-based) querying and browsing of images can be achieved. The experimental results demonstrate the effectiveness of our approach.
Fuzzy Linking Models for Pyramidal Edge Detection.

Commonality and postponement in multistage assembly systems.

Effects of Incompatible Boundary Information in EIT on the Convergence Behavior of an Iterative Algorithm.

A global approach to the variable ordering problem in PSBDDs.

Finding Target Language Correspondence for Lexicalized EBMT System.
This paper presents a three-phase  approach to find the correspondence in  Target Language (TL) sentence for a  fragment of Source Language (SL)  sentence in a lexicalized EBMT system. To be practical
Frequency sensitivity in Hodgkin%2DHuxley systems.

On optimal permutation codes.
Permutation codes are vector quantizers whose codewords are related by permutations and, in one variant, sign changes. Asymptotically, as the vector dimension grows, optimal Variant I permutation code design is identical to optimal entropy-constrained scalar quantizer (ECSQ) design. However, contradicting intuition and previously published assertions, there are finite block length permutation codes that perform better than the best ones with asymptotically large length; thus, there are Variant I permutation codes whose performances cannot be matched by any ECSQ. Along similar lines, a new asymptotic relation between Variant I and Variant II permutation codes is established but again demonstrated to not necessarily predict the performances of short codes. Simple expressions for permutation code performance are found for memoryless uniform and Laplacian sources. The uniform source yields the aforementioned counterexamples.
Internet dependency and psychosocial maturity among college students.

An SVD Decomposition of Essential Matrix with Eight Solutions for the Relative Positions of Two Perspective Cameras.

Efficient mining of weighted association rules %28WAR%29.
In this paper, we extend the tradition association rule problem by allowing a weight to be associated with each item in a transaction, to reflect interest/intensity of the item within the transaction. This provides us in turn with an opportunity to associate a weight parameter with each item in the resulting association rule. We call it weighted association rule (WAR). WAR not only improves the confidence of the rules, but also provides a mechanism to do more effective target marketing by identifying or segmenting customers based on their potential degree of loyalty or volume of purchases. Our approach mines WARs by first ignoring the weight and finding the frequent itemsets (via a traditional frequent itemset discovery algorithm), and is followed by introducing the weight during the rule generation. It is shown by experimental results that our approach not only results in shorter average execution times, but also produces higher quality results than the generalization of previous known methods on quantitative association rules.
Content Based Parallel Image Retrieval with Multi%2Dagent Cooperation.

QoS%2DSensitive Transport of Real%2DTime MPEG Video Using Adaptive Forward Error Correction.
This paper presents an adaptive end-to-end protocol for quality of service (QoS)-sensitive transport of real-time MPEG video using packet-level forward error correction in dynamic networks. The objective is to facilitate a user-specified QoS end-to-end -- i.e., without special network support -- for real-time MPEG video traffic whose timing constraints rule out the use of retransmission-based congestion control and QoS provisioning schemes. In previous work, we proposed an adaptive packet-level FEC protocol called AFEC and analyzed its properties with respect to optimality and stability. The control problem is nontrivial due to the fact that increased redundancy, beyond a certain point, can &#034;backfire&#034; resulting in self-induced congestion which impedes the timely recovery of information (e.g., MPEG video frames) at the receiver. In this paper, we extend the previous work by implementing and customizing AFEC to the transport of real-time MPEG video, realizing the system as a transport and ...
An Early DiscoWeb Prototype at TREC8.

AFEC An Adaptive Forward Error Correction Protocol for End%2Dto%2DEnd Transport of Real%2DTime Traffic.
This paper presents an adaptive protocol for packet-level forward error correction in dynamic networks. The objective is to facilitate end-to-end transport---i.e., without special network support---of real-time traffic whose timing constraints rule out the use of retransmission-based congestion control and quality of service (QoS) provision schemes. The degree of redundancy injected into the network is adjusted as a function of network state, decreasing when the network is well-behaved and increasing when it is not. The control problem is nontrivial due to the fact that increased redundancy, beyond a certain point, can backfire resulting in self-induced congestion which impedes the timely recovery of information at the receiver. In the first part of the paper, we give a comprehensive analysis of the control problem associated with adaptive forward error correction, concentrating on the dynamics of a particular protocol called Adaptive Forward Error Correction (AFEC). We show that insta...
Generalization%2DBased Data Mining in Object%2DOriented Databases Using an Object Cube Model.
Data mining is the discovery of knowledge and useful information from the large amounts of data stored in  databases. With the increasing popularity of object-oriented database systems in advanced database applications,  it is important to study the data mining methods for object-oriented databases because mining knowledge from  such databases may improve understanding, organization, and utilization of the data stored there.
Genetic algorithms for determining fuzzy measures from data.

Multispace Search for Minimizing the Maximum Nodal Degree.

Dynamics of the noisy neural network.

Passive Compliance from Robot Limbs and its Usefulness in Robotic Automation.

DBMiner A System for Mining Knowledge in Large Relational Databases.
A data mining system, DBMiner, has been developed  for interactive mining of multiple-level knowledge in  large relational databases. The system implements  a wide spectrum of data mining functions, including  generalization, characterization, association, classi#-  cation, and prediction. By incorporating several interesting  data mining techniques, including attributeoriented  induction, statistical analysis, progressive  deepening for mining multiple-level knowledge, and  meta-rule guided mining, the system provides a userfriendly,  interactive data mining environment with  good performance.
DBMiner Interactive Mining of Multiple%2DLevel Knowledge in Relational Databases.

Bilevel programming applied to the flow shop scheduling problem.

Hierarchical neural network for recognizing hand%2Dwritten characters in engineering drawings.

The Impact of Fault Expansion on the Interval Estimate for Fault Detection Coverage.

Extension of Lower Probabilities and Coherence of Belief Measures.

A Novel Discrete Relaxation Architecture.

